#include <iostream>
using namespace std;
#include "SerchBinaryTree.h"

int main()
{
	BSTree<int> b1;
	int a[] = { 1,7,8,9,6,5,4,2,3 };
	for (auto e : a)
	{
		b1.Insert(e);
	}
	b1.InOrder();

	for (auto e : a)
	{
		b1.Erase(e);
		b1.InOrder();
	}

	return 0;
}